SCALING OF INTERNODE DISTANCES IN WEIGHTED COMPLEX NETWORKS
نویسندگان
چکیده
منابع مشابه
Universal scaling of distances in complex networks.
Universal scaling of distances between vertices of Erdos-Rényi random graphs, scale-free Barabási-Albert models, science collaboration networks, biological networks, Internet Autonomous Systems and public transport networks are observed. A mean distance between two nodes of degrees k(i) and k(j) equals to (l(ij)) = A - B log(k(i)k(j)). The scaling is valid over several decades. A simple theory ...
متن کاملCharacterization of weighted complex networks.
To account for possible distinct functional roles played by different nodes and links in complex networks, we introduce and analyze a class of weighted scale-free networks. The weight of a node is assigned as a random number, based on which the weights of links are defined. We utilize the concept of betweenness to characterize the weighted networks and obtain the scaling laws governing the betw...
متن کاملScaling of nestedness in complex networks
Nestedness characterizes the linkage pattern of networked systems, indicating the likelihood that a node is linked to the neighbors of the nodes with larger degrees than it. Networks of mutualistic relationship between distinct groups of species in ecological communities exhibit such nestedness, which is known to support the network’s robustness. Despite such importance, the quantitative charac...
متن کامل3 Emergence of scaling in complex networks
Advances in many fields faced with complex systems, ranging from biology to computer science, are hindered by the limited understanding of the complex webs that characterize the interactions between the system’s constituents. These networks assemble and evolve through the addition and removal of nodes and links, dynamical processes that eventually determine their topology. There is increasing e...
متن کاملTypical distances in a geometric model of complex networks
The theme of this paper is the study of typical distances in a random graph model that was introduced by Krioukov et al. [25] and envisages basic properties of complex networks as the expression of an underlying hyperbolic geometry. This model gives rise to sparse random graphs on the hyperbolic plane which exhibit power law degree distribution as well as local clustering (i.e., they are locall...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Modern Physics C
سال: 2010
ISSN: 0129-1831,1793-6586
DOI: 10.1142/s0129183110015439